﻿/*
对称三位数素数 
Time Limit:1000MS  Memory Limit:32768K


Description:
判断一个数是否为对称三位数素数。所谓“对称”是指一个数，倒过来还是该数。例如，375不是对称数，因为倒过来变成了573。 

Input:
输入数据含有不多于50个的正整数(0<n<2^32)。 
Output:
对于每个n，如果该数是对称三位数素数，则输出“Yes”，否则输出“No”。每个判断结果单独列一行。 
Sample Input:
11 101 272
Sample Output:
No
Yes
No
*/

#include <iostream>
#include <algorithm>
using namespace std;

static const unsigned primes[]={101,103,107,109,113,127,131,137,139,
149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,
233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,
331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,
431,433,439,443,449,457,461,463,467,479,487,491,499,
503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,
613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,
719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,
827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,
941,947,953,967,971,977,983,991,997};
static const size_t primes_size = sizeof(primes)/sizeof(primes[0]);
//static const unsigned pos503=70U;
int main()
{
	for (unsigned num; cin>>num && num ;)
	{
		unsigned reversed=0U, num_=num;
		unsigned counter=0U;
		while(num_)
		{
			reversed=reversed*10+num_%10;
			num_/=10;
			counter++;
			if(counter>3)
				break;
		}
		if(3!=counter || reversed!=num)
		{
			cout<<"No"<<endl;
			continue;
		}

		if(binary_search(primes, primes+primes_size, num) && binary_search(primes, primes+primes_size, reversed))	
			cout<<"Yes"<<endl;
		else
			cout<<"No"<<endl;
	}
	return EXIT_SUCCESS;
}

/*

int main()
{
	for (unsigned num; cin>>num && num ;)
	{
		if(binary_search(primes, primes+primes_size, num))
		{
			unsigned reversed=0U;
			while(num)
			{
				reversed=reversed*10+num%10;
				num/=10;
			}
			if(binary_search(primes, primes+primes_size, reversed))		
				cout<<"Yes"<<endl;
			else
				cout<<"No"<<endl;
		}
		else
			cout<<"No"<<endl;
	}
	return EXIT_SUCCESS;
}
*/